class Solution {
public:
    vector<int> sumZero(int n) {
        
        vector<int> nRet;
        int pos=1;
        if(n&1){
            nRet.push_back(0);
            --n;
        }
        while(n){
            nRet.push_back(pos);
            nRet.push_back(-pos);
            ++pos;
            n-=2;
        }
        
        return nRet;
    }
};
